3 research outputs found
Automata–based Method for Solving Systems of Linear Constraints in {0,1}
We consider a finite state automata based method of solving a system of linear Diophantine equations
with coefficients from the set {-1,0,1} and solutions in {0,1}
The Matrix Method of Determining the Fault Tolerance Degree of a Computer Network Topology
This work presents a theoretical-graph method of determining the fault tolerance degree of the
computer network interconnections and nodes. Experimental results received from simulations of this method
over a distributed computing network environment are also presented
Ontology View on Automata Theory
The summary of automata theory ontology is presented in the paper. It is based on the following
dependences: a type of an automaton – the language accepted by the automaton – applications. The given
ontology does not claim to be exhaustive as automata theory is very extensive and it is a complicated problem to
survey all its aspects within one article. Only the main properties of automata and their applications are
considered